Non-Isomorphic Graphs with Cospectral Symmetric Powers
نویسندگان
چکیده
The symmetric m-th power of a graph is the graph whose vertices are m-subsets of vertices and in which two m-subsets are adjacent if and only if their symmetric difference is an edge of the original graph. It was conjectured that there exists a fixed m such that any two graphs are isomorphic if and only if their m-th symmetric powers are cospectral. In this paper we show that given a positive integer m there exist infinitely many pairs of non-isomorphic graphs with cospectral m-th symmetric powers. Our construction is based on theory of multidimensional extensions of coherent configurations.
منابع مشابه
Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements
The k-th power of a n-vertex graph X is the iterated cartesian product of X with itself. The k-th symmetric power of X is the quotient graph of certain subgraph of its k-th power by the natural action of the symmetric group. It is natural to ask if the spectrum of the k-th power –or the spectrum of the k-th symmetric power– is a complete graph invariant for small values of k, for example, for k...
متن کاملGroups all of whose undirected Cayley graphs are determined by their spectra
The adjacency spectrum Spec(Γ) of a graph Γ is the multiset of eigenvalues of its adjacency matrix. Two graphs with the same spectrum are called cospectral. A graph Γ is “determined by its spectrum” (DS for short) if every graph cospectral to it is in fact isomorphic to it. A group is DS if all of its Cayley graphs are DS. A group G is Cay-DS if every two cospectral Cayley graphs of G are isomo...
متن کاملA large family of cospectral Cayley graphs over dihedral groups
The adjacency spectrum of a graph Γ , which is denoted by Spec(Γ ), is the multiset of eigenvalues of its adjacency matrix. We say that two graphs Γ and Γ ′ are cospectral if Spec(Γ ) = Spec(Γ ). In this paper for each prime number p, p ≥ 23, we construct a large family of cospectral non-isomorphic Cayley graphs over the dihedral group of order 2p. © 2016 Elsevier B.V. All rights reserved.
متن کاملCospectral Graphs and Regular Orthogonal Matrices of Level 2
For a graph Γ with adjacency matrix A, we consider a switching operation that takes Γ into a graph Γ′ with adjacency matrix A′, defined by A′ = Q > AQ, where Q is a regular orthogonal matrix of level 2 (that is, Q > Q = I, Q1 = 1, 2Q is integral, and Q is not a permutation matrix). If such an operation exists, and Γ is nonisomorphic with Γ′, then we say that Γ′ is semi-isomorphic with Γ. Semiis...
متن کاملON NEW CLASSES OF MULTICONE GRAPHS DETERMINED BY THEIR SPECTRUMS
A multicone graph is defined to be join of a clique and a regular graph. A graph $ G $ is cospectral with graph $ H $ if their adjacency matrices have the same eigenvalues. A graph $ G $ is said to be determined by its spectrum or DS for short, if for any graph $ H $ with $ Spec(G)=Spec(H)$, we conclude that $ G $ is isomorphic to $ H $. In this paper, we present new classes of multicone graphs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 16 شماره
صفحات -
تاریخ انتشار 2009